Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
نویسندگان
چکیده
In the framework of Polynomial Eigenvalue Problems (PEPs), most matrix polynomials arising in applications are structured (namely, (skew-)symmetric, (skew-)Hermitian, (anti-)palindromic, or alternating). The standard way to solve PEPs is by means linearizations. frequently used linearizations belong general constructions, valid for all a fixed degree, known as companion It well known, however, that it not possible construct preserve any previous structures even degree. This motivates search more forms, particular $\ell$-ifications. this paper, we present, first time, family (generalized) $\ell$-ifications these structures, degree $k=(2d+1)\ell$. We also show how sparse within family. Finally, prove there no quadratifications quartic polynomials.
منابع مشابه
Trimmed linearizations for structured matrix polynomials
We discuss the eigenvalue problem for general and structured matrix polynomials which may be singular and may have eigenvalues at infinity. We derive condensed forms that allow (partial) deflation of the infinite eigenvalue and singular structure of the matrix polynomial. The remaining reduced order staircase form leads to new types of linearizations which determine the finite eigenvalues and c...
متن کاملStructured eigenvalue condition numbers and linearizations for matrix polynomials
This work is concerned with eigenvalue problems for structured matrix polynomials, including complex symmetric, Hermitian, even, odd, palindromic, and anti-palindromic matrix polynomials. Most numerical approaches to solving such eigenvalue problems proceed by linearizing the matrix polynomial into a matrix pencil of larger size. Recently, linearizations have been classified for which the penci...
متن کاملStructured Block Basis Factorization for Scalable Kernel Matrix Evaluation
Kernel matrices are popular in machine learning and scientific computing, but they are limited by their quadratic complexity in both construction and storage. It is well-known that as one varies the kernel parameter, e.g., the width parameter in radial basis function kernels, the kernel matrix changes from a smooth low-rank kernel to a diagonally-dominant and then fully-diagonal kernel. Low-ran...
متن کاملDecomposing multivariate polynomials with structured low-rank matrix completion
We are focused on numerical methods for decomposing a multivariate polynomial as a sum of univariate polynomials in linear forms. The main tool is the recent result on correspondence between the Waring rank of a homogeneous polynomial and the rank of a partially known quasi-Hankel matrix constructed from the coefficients of the polynomial. Based on this correspondence, we show that the original...
متن کاملMatrix Completion for Structured Observations
The need to predict or fill-in missing data, often referred to as matrix completion, is a common challenge in today’s data-driven world. Previous strategies typically assume that no structural difference between observed and missing entries exists. Unfortunately, this assumption is woefully unrealistic in many applications. For example, in the classic Netflix challenge, in which one hopes to pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Linear Algebra
سال: 2021
ISSN: ['1081-3810', '1537-9582']
DOI: https://doi.org/10.13001/ela.2021.5473